Much faster cross‐validation in PLSR‐modelling by avoiding redundant calculations
نویسندگان
چکیده
منابع مشابه
Caching Function Results: Faster Arithmetic by Avoiding Unnecessary Computation
This paper discusses trivial computation, where simple operands trivialize potentially complex operations. An example of a trivial operation is integer division, where the divisor is two; the division becomes a simple shift operation. The paper also discusses the concept of redundant computation, where some operation repeatedly does the same function because it repeatedly sees the same operands...
متن کاملFaster likelihood calculations on trees
Calculating the likelihood of observed DNA sequence data at the leaves of a tree is the computational bottleneck for phylogenetic analysis by Bayesian methods or by the method of maximum likelihood. Because analysis of even moderately sized data sets can require hours of computational time on fast desktop computers, algorithmic changes that substantially increase the speed of the basic likeliho...
متن کاملAvoiding Redundant Specialization during Partial Evaluation
Existing partial evaluators use a strategy called polyvariant specialization, which involves specializing program points on the known portions of their arguments, and re-using such specializations only when these known portions match exactly. We show that this re-use criterion is overly restrictive, and misses opportunities for sharing in residual programs, thus producing large residual program...
متن کاملAvoiding Unnecessary Calculations in Robot Navigation
For solving problems of robot navigation over unknown and changing terrain, many algorithms have been invented. For example, D* Lite, which is a dynamic, incremental search algorithm, is the most successful one. The improved performance of the D* Lite algorithm over other replanning algorithms is largely due to updating terrain cost estimates rather than recalculating them between robot movemen...
متن کاملAccelerating Learning from Experience: Avoiding Defects Faster
Over time, any programmer will learn from repeated mistakes. Can we speed up this learning and save many unnecessary repetitions of similar errors? This article presents a technique called \defect logging and defect data analysis" (DLDA) for doing exactly this. The technique is inspired by Humphrey's Personal Software Process but has much lower learning cost. It was validated in a controlled ex...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Chemometrics
سال: 2020
ISSN: 0886-9383,1099-128X
DOI: 10.1002/cem.3201